<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    153. Find Minimum in Rotated Sorted Array
   </h1>
   <p>
    Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
   </p>
   <p>
    (i.e., &nbsp;
    <code>
     [0,1,2,4,5,6,7]
    </code>
    &nbsp;might become &nbsp;
    <code>
     [4,5,6,7,0,1,2]
    </code>
    ).
   </p>
   <p>
    Find the minimum element.
   </p>
   <p>
    You may assume no duplicate exists in the array.
   </p>
   <p>
    <strong>
     Example 1:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> [3,4,5,1,2] 
<strong>Output:</strong> 1
</pre>
   <p>
    <strong>
     Example 2:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> [4,5,6,7,0,1,2]
<strong>Output:</strong> 0
</pre>
  </div>
  <div>
   <h1 class="question_title">
    153. 寻找旋转排序数组中的最小值
   </h1>
   <p>
    假设按照升序排序的数组在预先未知的某个点上进行了旋转。
   </p>
   <p>
    ( 例如，数组&nbsp;
    <code>
     [0,1,2,4,5,6,7]
    </code>
    <strong>
    </strong>
    可能变为&nbsp;
    <code>
     [4,5,6,7,0,1,2]
    </code>
    &nbsp;)。
   </p>
   <p>
    请找出其中最小的元素。
   </p>
   <p>
    你可以假设数组中不存在重复元素。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre><strong>输入:</strong> [3,4,5,1,2]
<strong>输出:</strong> 1</pre>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre><strong>输入:</strong> [4,5,6,7,0,1,2]
<strong>输出:</strong> 0</pre>
  </div>
 </body>
</html>